MODIFIED APPROXIMATE PROXIMAL POINT ALGORITHMS FOR FINDING ROOTS OF MAXIMAL MONOTONE OPERATORS

§1　Introduction and preliminariesA set T Rn×Rnis called a monotone operator on Rn,if T has the property(x,y) ,(x′,y′)∈T 〈x -x′,y -y′〉≥0 ,where〈·,·〉denotes the inner product on Rn.T is maximal if(considered as a graph) itis not strictly contained in any other monotone operator on Rn.It is well known that thetheory of maximal monotone operators plays an important role in the study of convexprogramming and variational inequalities since itcan provide a powerful general framework…     

Finding All Maximal Cliques in Dynamic Graphs

Clustering applications dealing with perception based or biased data lead to models with non-disjunct clusters. There, objects to be clustered are allowed to belong to several clusters at the same time which results in a fuzzy clustering. It can be shown that this is equivalent to searching all maximal cliques in dynamic graphs like G _t = (V,E _t), where E _{t – 1} E _t, t = 1,...,T; E ₀ = . In this article algorithms are provided to track all maximal cliques in a fully dynamic graph.     

A characterization of the finite simple groups with set of indices of their maximal subgroups

We study the problem concerning the influence of indices of maximal subgroups of a simple group on the structure of a group. We obtain a characterization property of all finite simple groups.     

Subspaces of Normed Riesz Spaces

It will be shown that a normed partially ordered vector space is linearly, norm, and order isomorphic to a subspace of a normed Riesz space if and only if its positive cone is closed and its norm p satisfies p(x)p(y) for all x and y with -yxy. A similar characterization of the subspaces of M-normed Riesz spaces is given. With aid of the first characterization, Krein's lemma on directedness of norm dual spaces can be directly derived from the result for normed Riesz spaces. Further properties of the norms ensuing from the characterization theorem are investigated. Also a generalization of the notion of Riesz norm is studied as an analogue of the r-norm from the theory of spaces of operators. Both classes of norms are used to extend results on spaces of operators between normed Riesz spaces to a setting with partially ordered vector spaces. Finally, a partial characterization of the subspaces of Riesz spaces with Riesz seminorms is given.     

A Littlewood-Paley type inequality

In this note we prove the following theorem: Let u be a harmonic function in the unit ball and . Then there is a constant C = C(p, n) such that

Boosts in an Arbitrary Direction and Maximal Causal Velocities in a Deformed Minkowski Space

We discuss boosts in a deformed Minkowski space, i.e., a four-dimensional spacetime with metric coefficients depending on nonmetric coordinates (in particular on the energy). The general form of a boost in an arbitrary direction is derived in the case of space anisotropy. Two maximal trivector velocities are mathematically possible, an isotropic and an anisotropic one. However, only the anisotropic velocity has physical meaning, being invariant indeed under deformed boosts.     

Extending hysteresis operators to spaces of piecewise continuous functions

We consider continuous-time hysteresis operators, defined to be causal and rate independent operators mapping input signals to output signals . We show how a hysteresis operator defined on the set of continuous piecewise monotone functions can be naturally extended to piecewise continuous piecewise monotone functions. We prove that the extension is also a hysteresis operator and that a number of important properties of the original operator are inherited by the extension. Moreover, we define the concept of a discrete-time hysteresis operator and we show that discretizing continuous-time hysteresis operators using standard sampling and hold operations leads to discrete-time hysteresis operators. We apply the concepts and results described above in the context of sampled-data feedback control of linear systems with input hysteresis.     

Extending the Balas-Yu bounds on the number of maximal independent sets in graphs to hypergraphs and lattices

A result of Balas and Yu (1989) states that the number of maximal independent sets of a graph G is at most ^p+1, where is the number of pairs of vertices in G at distance 2, and p is the cardinality of a maximum induced matching in G. In this paper, we give an analogue of this result for hypergraphs and, more generally, for subsets of vectors in the product of n lattices =₁××_n, where the notion of an induced matching in G is replaced by a certain binary tree each internal node of which is mapped into . We show that our bounds may be nearly sharp for arbitrarily large hypergraphs and lattices. As an application, we prove that the number of maximal infeasible vectors x=₁××_n for a system of polymatroid inequalities does not exceed max{Q,^logt/c(2Q,)}, where is the number of minimal feasible vectors for the system, , , and c(,) is the unique positive root of the equation 2^c(^c/log–1)=1. This bound is nearly sharp for the Boolean case ={0,1}ⁿ, and it allows for the efficient generation of all minimal feasible sets to a given system of polymatroid inequalities with quasi-polynomially bounded right-hand sides . This research was supported by the National Science Foundation (Grant IIS-0118635), and by the Office of Naval Research (Grant N00014-92-J-1375). The second and third authors are also grateful for the partial support by DIMACS, the National Science Foundation's Center for Discrete Mathematics and Theoretical Computer Science.Mathematics Subject Classification (2000):20E28, 20G40, 20C20     

Asymptotic limit for condensate solutions in the Abelian Chern-Simons Higgs model

In this paper we show that the maximal solutions in the Abelian Chern-Simons Higgs model on a 't Hooft type periodic domain converges to and is a harmonic map. We also study asymptotic behaviors of the energy density.

     

Maximal monotonicity, conjugation and the duality product

Recently, the authors studied the connection between each maximal monotone operator and a family of convex functions. Each member of this family characterizes the operator and satisfies two particular inequalities.

The aim of this paper is to establish the converse of the latter fact. Namely, that every convex function satisfying those two particular inequalities is associated to a unique maximal monotone operator.